Compositional and Assume-Guarantee Reasoning for Switching Linear Systems

نویسندگان

  • Florian Kerber
  • Arjan J. van der Schaft
چکیده

Modular modeling techniques play an important role in the analysis of engineering processes as well as in control applications. While individual components of aggregated models can be relatively simple, complexity increases significantly when interconnections are considered. To address the problem of complexity explosion, simulation relations can be employed to abstract system behaviors by lower order models. As an application to formal verification, simulation relations allow to check system properties such as safety requirements. In a compositional framework, they can be used to approximate interconnections of systems based on approximations of the individual components. While results with regard to compositional analysis have been presented for discrete and recently also for continuous-time systems, it is our aim to develop compositional and assume-guarantee reasoning for a specific class of hybrid systems, namely switching linear systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract Patterns of Compositional Reasoning

Patterns of Compositional Reasoning Nina Amla1, E. Allen Emerson2, Kedar Namjoshi3, and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent Technologies 4 Univ. of Waterloo Abstract. Compositional Reasoning – reducing reasoning about a conCompositional Reasoning – reducing reasoning about a concurrent system to reasoning about its individual components – is ...

متن کامل

Compositional Reasoning on (Probabilistic) Contracts

In this paper, we focus on Assume/Guarantee contracts consisting in (i) a non deterministic model of components behaviour, and (ii) a stochastic and non deterministic model of systems faults. Two types of contracts capable of capturing reliability and availability properties are considered. We show that Satisfaction and Refinement can be checked by effective methods thanks to a reduction to cla...

متن کامل

Abstraction and Assume-guarantee Reasoning for Automated Software Verification

ion and Assume-guarantee Reasoning for Automated Software Verification S. Chaki, E. Clarke, D. Giannakopoulou, and C.S. Păsăreanu 1 Carnegie Mellon Software Engineering Institute 2 Carnegie Mellon University 3 RIACS, NASA Ames Research Center, Moffett Field, CA, USA 4 Kestrel Technology LLC, NASA Ames Research Center, Moffett Field, CA, USA Abstract. Compositional verification and abstraction a...

متن کامل

Towards a Compositional SPIN

This paper discusses our initial experience with introducing automated assume-guarantee verification based on learning in the SPIN tool. We believe that compositional verification techniques such as assume-guarantee reasoning could complement the state-reduction techniques that SPIN already supports, thus increasing the size of systems that SPIN can handle. We present a (‘light-weight” approach...

متن کامل

Assume-Guarantee Abstraction Refinement Meets Hybrid Systems

Compositional verification techniques in the assumeguarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009